Monitoring and Improving Markov Chain Monte Carlo Convergence by Partitioning

نویسندگان

  • Douglas Nielsen VanDerwerken
  • David B. Dunson
  • Li Ma
  • Jonathan C. Mattingly
چکیده

Monitoring and Improving Markov Chain Monte Carlo Convergence by Partitioning by Douglas Nielsen VanDerwerken Department of Statistical Science Duke University

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Stochastic algorithm to solve multiple dimensional Fredholm integral equations of the second kind

In the present work‎, ‎a new stochastic algorithm is proposed to solve multiple dimensional Fredholm integral equations of the second kind‎. ‎The solution of the‎ integral equation is described by the Neumann series expansion‎. ‎Each term of this expansion can be considered as an expectation which is approximated by a continuous Markov chain Monte Carlo method‎. ‎An algorithm is proposed to sim...

متن کامل

To Boldly Split: Partitioning Space Filling Curves by Markov Chain Monte Carlo Simulation

Space filling curves are a class of fractals that are important mathematical descriptions of the appearance and shape of natural objects. There is growing interest in the modelling of such curves to measure pathology in medicine and biology. This work presents a method of modelling fractal curves, such as the boundary of brain white matter, and partitioning such curves in to segments having equ...

متن کامل

Automatically Tuned General-Purpose MCMC via New Adaptive Diagnostics

Adaptive Markov Chain Monte Carlo (MCMC) algorithms attempt to ‘learn’ from the results of past iterations so the Markov chain can converge quicker. Unfortunately, adaptive MCMC algorithms are no longer Markovian, so their convergence is difficult to guarantee. In this paper, we develop new diagnostics to determine whether the adaption is still improving the convergence. We present an algorithm...

متن کامل

Markov Chain Monte Carlo and Related Topics

This article provides a brief review of recent developments in Markov chain Monte Carlo methodology. The methods discussed include the standard Metropolis-Hastings algorithm, the Gibbs sampler, and various special cases of interest to practitioners. It also devotes a section on strategies for improving mixing rate of MCMC samplers, e.g., simulated tempering, parallel tempering, parameter expans...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015